Multi-Objective 3-SAT with Survey-Propagation
نویسندگان
چکیده
An original approach to multi-objective optimization is introduced, using a message-passing algorithm to sample the Pareto set, i.e. the set of Pareto-nondominated solutions. Several heuristics are proposed and tested on a simple biobjective 3-SAT problem. The first one is based on a straightforward deformation of the Survey-Propagation (SP) equation to locally encode a Pareto trade-off. A simple heuristic is then tested, which combines an elimination procedure of clauses with the usual decimation of variables used in the SP algorithm, and is able to sample different regions of the Pareto-front. We study in more details the compliance of these deformed equations with basic Belief-Propagation (BP) properties. This first leads to an explicit Markov Random Field (MRF) of valid warning configuration, for which the SP equations are basic BP equations. This observation is then generalized to the multi-objective context. Numerical experiments on artificial problems up to 10 variables are presented and discussed.
منابع مشابه
Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem
The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginals over covers that represent clusters of solutions. The SP-y algorithm generalizes SP to work on the maximum satisfiability (Max-SAT) problem, but the cover interpretation of SP does not generalize to SP-y. In this pap...
متن کاملComparing Beliefs, Surveys, and Random Walks
Survey propagation is a powerful technique from statistical physics that has been applied to solve the 3-SAT problem both in principle and in practice. We give, using only probability arguments, a common derivation of survey propagation, belief propagation and several interesting hybrid methods. We then present numerical experiments which use WSAT (a widely used random-walk based SAT solver) to...
متن کاملSAT-Solving: Performance Analysis of Survey Propagation and DPLL
The Boolean Satisfiability Problem (SAT) belongs to the class of NP-complete problems, meaning that there is no known deterministic algorithm that can solve an arbitrary problem instance in less than exponential time (parametrized on the length of the input). There is great industrial demand for solving SAT, motivating the need for algorithms which perform well. I present a comparison of two ap...
متن کاملSurvey Propagation for Random K-sat problems
This report will attempt to summarize some recent research on the random Ksat problem. After a brief introduction, we will describe some recently proposed algorithms for random K-sat, in particular the “survey propagation” algorithm. We will explain the equivalence of survey propagation to an appropriately defined belief propagation iteration, which a well-known iterative technique for estimati...
متن کاملAnalysing Survey Propagation Guided Decimationon Random Formulas
Let ~ Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. For clauses/variables ratio m/n ≤ rk-SAT ∼ 2 ln 2 the formula ~ Φ is satisfiable with high probability. However, no efficient algorithm is known to provably find a satisfying assignment beyond m/n ∼ 2k ln(k)/k with a non-vanishing probability. Non-rigorous statistical mechanics work on k-CNF led to the devel...
متن کامل